Matching is as easy as matrix inversion
نویسندگان
چکیده
منابع مشابه
Matrix Inversion Is As Easy As Exponentiation
Abstract. We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [6], we establish an equivalence between matrix inversion and exponentiation up to polylogarithmic factors. In particular, this connection justifies the use of Laplacian solvers for designing fast semi-definite pr...
متن کاملDesign Is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget constraint. We undertake a systematic algorithmic and complexity-theoretic study of such problems, which we call problems design problems. Every optimization problem leads to a natural design problem. Our main result uses techniques of Freund-Schapire [FS99] from learning theory, and its generalization...
متن کاملFinding Is as Easy as Detecting for Quantum Walks
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set M consists of a single vertex, the number of steps of the quantum walk is quadratically smaller than the classical hitting time HT(P,M) of any reversible random walk P on the graph. In the case of multiple marked elements, the number of steps is g...
متن کاملIt’s As Easy As abc
1224 NOTICES OF THE AMS VOLUME 49, NUMBER 10 Fermat’s Last Theorem In this age in which mathematicians are supposed to bring their research into the classroom, even at the most elementary level, it is rare that we can turn the tables and use our elementary teaching to help in our research. However, in giving a proof of Fermat’s Last Theorem, it turns out that we can use tools from calculus and ...
متن کاملOn Innnite Sequences (almost) as Easy As
It is known that innnite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are sequences of constant, polynomial-time bounded Kolmogorov complexity that are not polynomial-time computable. This motivates the study of several resource-bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1987
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02579206